Spanning even subgraphs of 3-edge-connected graphs
نویسندگان
چکیده
By Petersen’s theorem, a bridgeless cubic graph has a 2-factor. H. Fleischner extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has a spanning even subgraph. Our main result is that, under the stronger hypothesis of 3-edge-connectivity, we can find a spanning even subgraph in which every component has at least five vertices. We show that this is in some sense best possible by constructing an infinite family of 3-edge-connected graphs in which every spanning even subgraph has a 5-cycle as a component.
منابع مشابه
Series-parallel subgraphs of planar graphs
In this paper we show that every 3-connected (3-edge-connected) planar graph contains a 2-connected (respectively, 2-edge-connected) spanning partial 2-tree (seriesparallel) graph. In contrast, a recent result by [4] implies that not all 3-connected graphs contain 2-edge-connected series-parallel spanning subgraphs.
متن کاملGenerating 3-vertex connected spanning subgraphs
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial time, i.e., for every K we can generate K (or all) minimal 3-vertex connected spanning subgraphs of a given graph in O(K2log(K)m2 +K2m3) time, where n and m are the number of vertices and edges of the input graph, respec...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملTwo Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph
In a paper of Harary and Plantholt, they concluded by noting that they knew of no generalization of the leaf edge exchange (LEE) transition sequence result on spanning trees to other natural families of spanning subgraphs. Now, we give two approaches for such a generalization. We define two kinds of LEE-graphs over the set of all connected spanning k-edge subgraphs of a connected graph G, and s...
متن کاملGenerating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs
We show that k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k. We also show that generating k-edge connected spanning subgraphs, where k is part of the input, can be done in incremental polynomial time. These results are based on properties of minimally k-connected graphs which might be of independent interest.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 62 شماره
صفحات -
تاریخ انتشار 2009